Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks
نویسندگان
چکیده
This paper deals with the Assembly Line Balancing Problem considering incompatibilities between the tasks with the aim of, first, minimizing the number of workstations and, then, minimizing the cycle time for the minimum number of workstations. In order to solve the problem we propose the use of a Greedy Randomized Adaptive Search Procedure (GRASP) obtained from the application of some classic heuristics, based on priority rules, and a genetic algorithm that searches for the solution in the heuristic space. A computational experience is included to illustrate the performance of the proposed approach.
منابع مشابه
A Hybrid Unconscious Search Algorithm for Mixed-model Assembly Line Balancing Problem with SDST, Parallel Workstation and Learning Effect
Due to the variety of products, simultaneous production of different models has an important role in production systems. Moreover, considering the realistic constraints in designing production lines attracted a lot of attentions in recent researches. Since the assembly line balancing problem is NP-hard, efficient methods are needed to solve this kind of problems. In this study, a new hybrid met...
متن کاملSolving a multi-objective mixed-model assembly line balancing and sequencing problem
This research addresses the mixed-model assembly line (MMAL) by considering various constraints. In MMALs, several types of products which their similarity is so high are made on an assembly line. As a consequence, it is possible to assemble and make several types of products simultaneously without spending any additional time. The proposed multi-objective model considers the balancing and sequ...
متن کاملAssembly line balancing to minimize balancing loss and system loss
Assembly Line production is one of the widely used basic principles in production system. The problem of Assembly Line Balancing deals with the distribution of activities among the workstations so that there will be maximum utilization of human resources and facilities without disturbing the work sequence. Research works reported in the literature mainly deals with minimization of idle time i.e...
متن کاملThe Assembly Line Balancing Problem Solved by Hybrid Heuristic Procedures and Driven Exploration
This paper deals with the assembly line balancing problem with incompatibilities between tasks with two hierarchical objectives: minimising the number of stations, and once these are fixed, minimising the cycle time. It is solved through CPLEX optimiser software, in which we have introduced a bounding procedure and an exploration strategy based on greedy heuristic priority rules.
متن کاملA new heuristic method based on CPM in SALBP
The task of balancing of assembly lines is well-known in mass production system but this problem is NP-hard even for the simple straight line. Therefore, utilizing heuristic methods for these problems is totally unquestionable. Furthermore, in line with balancing problems, heuristic methods are the foundation of the metaheuristic methods, thus it seems to be necessary to use more efficient heur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000